Infrastructure for Smart Cities: The Killer Application for Event-Based Computing

Infrastructures for smart cities are considered a potential killer app for event-based computing. Event services are a crucial part of the infrastructure. The complexity of the event services is compounded by the richness of the events, the number of (mobile) sensors and devices, heterogeneity, requirements for seamless integration, unstable communication and interference, quality of service requirements, the need for context awareness and device orchestration and self-X properties

Today\u27s Elementary School Library

A library is a library... A library is a place for books. And Books need people to enjoy them, children to pore over them, to wander through them and wonder, to leaf over them and laugh over them and love them. Teacher need to know them to delight in them, and to want to share them. Librarians who are not merely the keepers by the ambassadors of books, their representatives, their introducers, their friends and advocates. The above statement is one which this paper will attempt to prove is very correct. One of the most stimulating and interesting developments in the elementary schools of today is the new relationship between curriculum planning and instructional material. The result is a learning center called a centralized library where children may use and explore all types of printed and nonsense material. This helps to satisfy their intellectual curiosity as well as fulfill the more specific demands made in the classroom. The elementary school library, audio=visual expert and curriculum specialist are forming a working trio to continually explore new ways to co-ordinating their services and wares. They know they must share their knowledge and skills. Together they must pool the vast resources into a centralized department

Acdmcp: An adaptive and completely distributed multi-hop clustering protocol for wireless sensor networks

Clustering is a very popular network structuring technique which mainly addresses the issue of scalability in large scale Wireless Sensor Networks. Additionally, it has been shown to improve the energy efficiency and prolong the life of the network. The suggested protocols mostly base their clustering criteria on some grouping attribute(s) of the nodes. One important attribute that is largely ignored by most of the existing multi-hop clustering protocols is the reliability of the communication links between the nodes. In this paper, we suggest an adaptive and completely distributed multi-hop clustering protocol that incorporates different notions of reliability of the communication links, among other things, into a composite metric and uses it in all phases of the clustering process. The joining criteria for the nodes, which lie at one hop from the elected cluster heads, to a particular cluster not only consider the reliability of their communication link with their cluster head but also other important attributes. The nodes that lie outside the communication range of cluster heads become cluster members transitively through existing cluster members utilizing the end-to-end notion of link reliability, between the nodes and the cluster heads, along with other important attributes. Similarly, inter-cluster communication paths are selected using a set of criteria that includes the end-to-end communication link reliability with the sink node along with other important node and network attributes. We believe that incorporating link reliability in all phases of clustering process results in an efficient multi-hop communication hierarchy that has the potential of bringing down the total communication costs in the network

Effective DMBS space management on native Flash

In this paper we build on our research in data management on native Flash storage. In particular we demonstrate the advantages of intelligent data placement strategies. To effectively manage phsical Flash space and organize the data on it, we utilize novel storage structures such as regions and groups. These are coupled to common DBMS logical structures, thus require no extra overhead for the DBA. The experimental results indicate an improvement of up to 2x, which doubles the longevity of Flash SSD. During the demonstration the audience can experience the advantages of the proposed approach on real Flash hardware

A Peer-to-Peer Approach to Content-Based Publish/Subscribe

Publish/subscribe systems are successfully used to decouple distributed applications. However, their e#ciency is closely tied to the topology of the underlying network, the design of which has been neglected. Peer-to-peer network topologies can o#er inherently bounded delivery depth, load sharing, and self-organisation. In this paper, we present a contentbased publish/subscribe system routed over a peer-to-peer topology graph. The implications of combining these approaches are explored and a particular implementation using elements from Rebeca and Chord is proven correct

Revisiting DBMS Space Management for Native Flash

ABSTRACT In this paper we present our work in progress on revisiting traditional DBMS mechanisms to manage space on native Flash and how it is administered by the DBA. Our observations and initial results show that: the standard logical database structures can be used for physical organization of data on native Flash; at the same time higher DBMS performance is achieved without incurring extra DBA overhead. Initial experimental evaluation indicates a 20% increase in transactional throughput under TPC-C, by performing intelligent data placement on Flash, less erase operations and thus better Flash longevity